Approximation with Conditionally Positive Definite Kernels on Deficient Sets
نویسندگان
چکیده
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets centers that are not determining for polynomials. It shown polynomial consistence sufficient in order to define kernel-based numerical the functional usual properties optimal recovery. Application examples include generation sparse differentiation formulas Laplacian a grid accurate function an ellipse.
منابع مشابه
Conditionally Positive Definite Kernels and Pontryagin Spaces
Conditionally positive definite kernels provide a powerful tool for scattered data approximation. Many nice properties of such methods follow from an underlying reproducing kernel structure. While the connection between positive definite kernels and reproducing kernel Hilbert spaces is well understood, the analog relation between conditionally positive definite kernels and reproducing kernel Po...
متن کاملConditionally Positive Definite Kernels and Infinitely Divisible Distributions
We give a precise characterization of two important classes of conditionally positive definite (CPD) kernels in terms of integral transforms of infinitely divisible distributions. In particular, we show that for any stationary CPD kernel A(x, y) = f(x − y), f is the log-characteristic function of a uniquely determined infinitely divisible distribution; further, for any additive CPD kernel A(x, ...
متن کاملConditionally positive definite kernels: theoritical contribution, application to interpolation and approximation
Since Aronszajn (1950), it is well known that a functional Hilbert space, called Reproducing Kernel Hilbert Space (R.K.H.S ), can be associated to any positive definite kernel K. This correspondance is the basis of many useful algorithms. In the more general context of conditionally positive definite kernels the native spaces are the usual theoretical framework. However, the definition of condi...
متن کاملPositive Definite Rational Kernels
Kernel methods are widely used in statistical learning techniques. We recently introduced a general kernel framework based on weighted transducers or rational relations, rational kernels, to extend kernel methods to the analysis of variable-length sequences or more generally weighted automata. These kernels are efficient to compute and have been successfully used in applications such as spoken-...
متن کاملCertain Positive-definite Kernels
In one way or another, the extension of the standard Brownian motion process {B¡: t e [0,oo)} to a (Gaussian) random field {Bt: t € R+} involves a proof of the positive semi-definiteness of the kernel used to generalize p(s, 1) = cov(Bs,B¡) = s A t to multidimensional time. Simple direct analytical proofs are provided here for the cases of (i) the Levy multiparameter Brownian motion, (ii) the C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Springer proceedings in mathematics & statistics
سال: 2021
ISSN: ['2194-1009', '2194-1017']
DOI: https://doi.org/10.1007/978-3-030-57464-2_3